A Parallel PageRank Algorithm with Power Iteration Acceleration
نویسندگان
چکیده
منابع مشابه
A Parallel PageRank Algorithm with Power Iteration Acceleration
Based on the study about the basic idea of PageRank algorithm, combining with the MapReduce distributed programming concepts, the paper first proposed a parallel PageRank algorithm based on adjacency list which is suitable for massive data processing. Then, after examining the essential characteristics of iteration hidden behind the PageRank, it provided an iteration acceleration model based on...
متن کاملA Power-Arnoldi algorithm for computing PageRank
The PageRank algorithm plays an important role in modern search engine technology. It involves using the classical power method to compute the principle eigenvector of the Google matrix representing the web link graph. However, when the largest eigenvalue is not well separated from the second one, the power method may perform poorly. This happens when the damping factor is sufficiently close to...
متن کاملScalable Computing for Power Law Graphs: Experience with Parallel PageRank
In this paper we report on the behavior of parallel numerical algorithms applied to computing the PageRank vector for a 1.5 billion node directed webgraph. We also describe the details of our parallel implementation that was able to compute the PageRank vector for this webgraph on a distributed memory 140 processor RLX cluster in under 6 minutes. Historically, much of the work in parallel compu...
متن کاملAn Inner-Outer Iteration for Computing PageRank
We present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Our convergence analysis shows that the algorithm is effective for a crude inner tolerance and is not sensitive to the choice...
متن کاملD-Iteration: diffusion approach for solving PageRank
In this paper we present a new method that can accelerate the computation of the eigenvector of the transition matrix associated to the PageRank algorithm. Our method, called D-Iteration, is based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model and is potentially adapted to asynchronous implementation. We also make a comparison with OPIC (Online Pag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Grid and Distributed Computing
سال: 2015
ISSN: 2005-4262,2005-4262
DOI: 10.14257/ijgdc.2015.8.2.24